A Note on Convex Approximation in Lp
نویسندگان
چکیده
منابع مشابه
SOME ESTIMATES FOR CONVEX POLYNOMIAL APPROXIMATION IN Lp
We prove a direct theorem for convex polynomial L p-approximation, 0 < p < 1, in terms of the classical modulus of smoothness ! 3 (f; t) p. This theorem may be regarded as an extension to L p of the well-known pointwise estimates of the Timan type and their variants of R. DeVore, Y. K. Hu and D. Leviatan for convex approximation in L p. It leads to a characterization of convex functions in Lips...
متن کاملConvex Polynomial and Spline Approximation in Lp , 0 < p <
We prove that a convex function f 6 L p [ -1 , 1], 0 < p < cx~, can be approximated by convex polynomials with an error not exceeding Cw~ (f, 1/n)p where w~(f, .) is the Ditzian-Totik modulus of smoothness of order three of f . We are thus filling the gap between previously known estimates involving og~(f, I/n)p, and the impossibility of having such estimates involving ~o4. We also give similar...
متن کاملA NOTE ON AN LP-BRUNN-MINKOWSKI INEQUALITY FOR CONVEX MEASURES IN THE UNCONDITIONAL CASE By
We consider a different L-Minkowski combination of compact sets in R than the one introduced by Firey and we prove an L-BrunnMinkowski inequality, p ∈ [0, 1], for a general class of measures called convex measures that includes log-concave measures, under unconditional assumptions. As a consequence, we derive concavity properties of the function t 7→ μ(t 1 pA), p ∈ (0, 1], for unconditional con...
متن کاملA Note on Complexity of Lp Minimization
We show that the Lp (0 ≤ p < 1) minimization problem arising from sparse solution construction and compressed sensing is both hard and easy. More precisely, for any fixed 0 < p < 1, we prove that checking the global minimal value of the problem is NP-Hard; but computing a local minimizer of the problem is polynomialtime doable. We also develop an interior-point algorithm with a provable complex...
متن کاملA Note on Convex Functions
In this paper, we give twoweak conditions for a lower semi-continuous function on the n-dimensional Euclidean space Rn to be a convex function. We also present some results for convex functions, strictly convex functions, and quasi-convex functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1995
ISSN: 0021-9045
DOI: 10.1006/jath.1995.1039